String-matching cannot be done by a two-head one-way deterministic finite automaton

A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads

A Partial Deterministic Automaton for Approximate String Matching

One of the simplest approaches to approximate string matching is to consider the associated non-deterministic nite automaton and make it deterministic. Besides automaton generation, the search time is O(n) in the worst case, where n is the text size. This solution is mentioned in the classical literature but has not been further pursued, due to the large number of automaton states that may be g...

Sampling a Two-way Finite Automaton

We study position sampling in a two-way nondeterministic finite automaton (2NFA) to measure information flow between state variables, based on the information-theoretic sampling technique proposed in [20]. We prove that for a 2NFA, the language generated by position sampling is regular. We also show that for a 2NFA, we can effectively find a vector of sampling positions that maximizes informati...

BCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

Parallel String Matching Algorithms

String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.